Oversubscription Planning: Complexity and Compilability
نویسندگان
چکیده
Many real-world planning problems are oversubscription problems where all goals are not simultaneously achievable and the planner needs to find a feasible subset. We present complexity results for the so-called partial satisfaction and net benefit problems under various restrictions; this extends previous work by van den Briel et al. Our results reveal strong connections between these problems and with classical planning. We also present a method for efficiently compiling oversubscription problems into the ordinary plan existence problem; this can be viewed as a continuation of earlier work by
منابع مشابه
In Search of Tractability for Partial Satisfaction Planning
The objective of partial satisfaction planning is to achieve an as valuable as possible state, tacking into account the cost of its achievement. In this work we investigate the computational complexity of restricted fragments of two variants of partial satisfaction: net-benefit and oversubscription planning. In particular, we examine restrictions on the causal graph structure and variable domai...
متن کاملParameterized Compilability
Compilability is a measure of how effectively compilation (or preprocessing) can be applied to knowledge bases specified in a particular knowledge representation formalism; the aim of compilation is to allow for efficient, on-line query processing. A theory of compilability has been established for organizing knowledge representation formalisms according to a scheme of “compilability classes”, ...
متن کاملAbstractions for Oversubscription Planning
ions for Oversubscription Planning Vitaly Mirkis and Carmel Domshlak Technion Israel Institute of Technology Haifa, Israel {dcarmel,mirkis}@tx.technion.ac.il
متن کاملDeterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
While in classical planning the objective is to achieve one of the equally attractive goal states at as low total action cost as possible, the objective in deterministic oversubscription planning (OSP) is to achieve an as valuable as possible subset of goals within a fixed allowance of the total action cost. Although numerous applications in various fields share the latter objective, no substan...
متن کاملComputational Complexity of some Optimization Problems in Planning
Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. We use this methodology for studying the computatio...
متن کامل